- 圖靈等價(jià)
- 圖靈完全
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
turing completeness中文什么意思
百科釋義
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. A classic example is the lambda calculus.
詳細(xì)百科解釋